On an Optimal Deterministic Algorithm for SAT
نویسنده
چکیده
J. Kraj cek and P. Pudll ak proved that an almost optimal deterministic algorithm for TAUT exists if and only if there exists a p-optimal proof system for TAUT. In this paper we prove that an almost optimal deterministic algorithm for SAT exists if and only if there exists a p-optimal proof system for SAT. Combining Kraj cek and Pudll ak's result with our result we show that an optimal deterministic algorithm for SAT exists if and only if both p-optimal proof systems for TAUT and for SAT exist.
منابع مشابه
on Mathematical and Computing Sciences : TR - C 146 title : An Improved Randomized Algorithm for 3 - SAT author :
Schöning [Sch99] proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. His analysis showed that for 3-SAT, finding a satisfying assignment of any satisfiable formula F with n variables can be achieved in poly(n) · (4/3) (= poly(n) · (1.3333)) expected time, which is optimal up to now. In this paper, we improve this expected time bound by using a combination of a de...
متن کاملSimpler 3/4-Approximation Algorithms for MAX SAT
We consider the recent randomized 3 4 -algorithm for MAX SAT of Poloczek and Schnitger. We give a much simpler set of probabilities for setting the variables to true or false, which achieve the same expected performance guarantee. Our algorithm suggests a conceptually simple way to get a deterministic algorithm: rather than comparing to an unknown optimal solution, we instead compare the algori...
متن کاملBounds on Greedy Algorithms for MAX SAT
We study adaptive priority algorithms for MAX SAT and show that no such deterministic algorithm can reach approximation ratio 3 4 , assuming an appropriate model of data items. As a consequence we obtain that the Slack–Algorithm of [13] cannot be derandomized. Moreover, we present a significantly simpler version of the Slack–Algorithm and also simplify its analysis. Additionally, we show that t...
متن کاملDegree of Optimality as a Measure of Distance of Power System Operation from Optimal Operation
This paper presents an algorithm based on inter-solutions of having scheduled electricity generation resources and the fuzzy logic as a sublimation tool of outcomes obtained from the schedule inter-solutions. The goal of the algorithm is to bridge the conflicts between minimal cost and other aspects of generation. In the past, the optimal scheduling of electricity generation resources has been ...
متن کاملIntegrated JIT Lot-Splitting Model with Setup Time Reduction for Different Delivery Policy using PSO Algorithm
This article develops an integrated JIT lot-splitting model for a single supplier and a single buyer. In this model we consider reduction of setup time, and the optimal lot size are obtained due to reduced setup time in the context of joint optimization for both buyer and supplier, under deterministic condition with a single product. Two cases are discussed: Single Delivery (SD) case, and Multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998